APPROXIMATION OF THE MEAN WAITING TIME IN THE M / H 2 / s QUEUE
نویسنده
چکیده
In this paper a closed formula to estimate the mean waiting time in the M/H2/s queue is presented. The proposed formula takes into account the first three moments of the H2 holding time distribution and is extremely easy to compute, while the accuracy is similar to other more complex approximations. The results presented here can be extended to calculate the mean waiting time in the M/G/s queue. Some applications to mobile communications are mentioned in the paper.
منابع مشابه
Analysis of a Single Server Queue with Working Vacation and Vacation Interruption
In this paper, an M/M/1 queue with working vacation and vacation interruption is investigated. The server is supposed to take a working vacation whenever the system becomes empty and if there are at least N customers waiting in the system at a service completion instant, vacation interruption happens and the server resumes a normal working period. A matrix geometric approach is employed to obta...
متن کاملOptimization of M G 1 Queue with Vacation (TECHNICAL NOTE)
This paper reports on the minimization of the average waiting time of the customers in the M/G/1 queue with vacation. Explicit formula for the unknown service parameter of a particular customer has been obtained by considering the exhaustive service discipline in the case of multi-user with unlimited service system. Moreover, results in case of partially gated and gated service disciplines unde...
متن کاملDiffusion Process for Multi - Repairmen Machining System with Spares Aand Balking
In this paper we describe G/G/R+s multi- repairmen machining system with balking. The system consists of M operating machines, S spare machines, R permanent and s additional repairmen. Assuming the discrete flow of machines by continuous one, the diffusion approximation technique for the machine repair system has developed. The system will be in normal working mode if there is M operating machi...
متن کاملDISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...
متن کاملAn engineering approximation for the mean waiting time in the M/H2/s queue
Although the exact solution for the mean waiting time in the M/H2/s queue exists, it requires advanced programming skills and processing capacity. In most engineering problems the offered traffic and its features are known with a certain degree of uncertainty (e.g. traffic is predicted, traffic is not clearly Poisson, etc). In such environments where perfect accuracy is not required, approximat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997